Recognizing edge clique graphs among interval graphs and probe interval graphs
نویسندگان
چکیده
The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H. We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique graphs} ∩ {probe interval graphs}, which leads to polynomial time recognition algorithms for them. This work generalizes corresponding results in [M.R. Cerioli, J.L. Szwarcfiter, Edge clique graphs and some classes of chordal graphs, Discrete Mathematics 242 (2002), 31–39.] Keywords–edge clique graphs, interval graphs, probe interval graphs
منابع مشابه
Threshold dominating cliques in random graphs and interval routing
The existence of (shortest-path) interval routing schemes for random graphs that use at most one interval label per edge is an open problem posed in [8]. In this paper, we show that for any random graph G(n, p) with edge probability p > 0.765, there exists an interval routing scheme that uses at most one label per edge and has an additive stretch 1. In doing so, we provide an interesting constr...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملCharacterization of classical graph classes by weighted clique graphs
Given integers m1, . . . ,ml, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i = 1, . . . , l. This weight equals the cardinality of the intersection of the cliques of G corresponding to S. We characterize weighted clique graphs in similar terms as Roberts and Spencer’s characterization of clique g...
متن کاملA Faster Algorithm for Recognizing Edge-Weighted Interval Graphs
Interval graphs—the intersection graphs of one dimensional intervals—are considered one of the most useful mathematical structures to model real life applications [18]. Interval graphs have been widely studied since they first appeared in the literature in 1957. In 1976, Booth and Lueker [7] introduced a data structure called PQ-trees that could recognize interval graphs in linear time; since t...
متن کاملClique-width of full bubble model graphs
A bubble model is a 2-dimensional representation of proper interval graphs. We consider proper interval graphs that have bubble models of specific properties. We characterise the maximal such proper interval graphs of bounded clique-width and of bounded linear cliquewidth and the minimal such proper interval graphs whose clique-width and linear cliquewidth exceed the bounds. As a consequence, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 20 شماره
صفحات -
تاریخ انتشار 2007